Statistica Sinica 5(1995), 41-54 CONVERGENCE IN NORM FOR ALTERNATING EXPECTATION-MAXIMIZATION (EM) TYPE ALGORITHMS
نویسندگان
چکیده
We provide a su cient condition for convergence of a general class of alternating estimation-maximization (EM) type continuous-parameter estimation algorithms with respect to a given norm. This class includes EM, penalized EM, Green's OSL-EM, and other approximate EM algorithms. The convergence analysis can be extended to include alternating coordinate-maximization EM algorithms such as Meng and Rubin's ECM and Fessler and Hero's SAGE. The condition for monotone convergence can be used to establish norms under which the distance between successive iterates and the limit point of the EM-type algorithm approaches zero monotonically. For illustration, we apply our results to estimation of Poisson rate parameters in emission tomography and establish that in the nal iterations the logarithm of the EM iterates converge monotonically in a weighted Euclidean norm.
منابع مشابه
Penalized maximum-likelihood image reconstruction using space-alternating generalized EM algorithms
Most expectation-maximization (EM) type algorithms for penalized maximum-likelihood image reconstruction converge slowly, particularly when one incorporates additive background effects such as scatter, random coincidences, dark current, or cosmic radiation. In addition, regularizing smoothness penalties (or priors) introduce parameter coupling, rendering intractable the M-steps of most EM-type ...
متن کاملSpace-Alternating Generalized Expectation-Maximization Algorithm
The expectation-maximization (EM) method can facilitate maximizing likelihood functions that arise in statistical estimation problems. In the classical EM paradigm, one iteratively maximizes the conditional log-likelihood of a single unobservable complete data space, rather than maximizing the intractable likelihood function for the measured or incomplete data. EM algorithms update all paramete...
متن کاملSpace - Alternating Generalized Expectation - Maximization AlgorithmJe rey
| The expectation-maximization (EM) method can facilitate maximizing likelihood functions that arise in statistical estimation problems. In the classical EM paradigm, one iteratively maximizes the conditional log-likelihood of a single unobservable complete data space, rather than maximizing the intractable likelihood function for the measured or incomplete data. EM algorithms update all parame...
متن کاملSpace-alternating generalized expectation-maximization algorithm
The expectation-maximization (EM) method can facilitate maximizing likelihood functions that arise in statistical estimation problems. In the classical EM paradigm, one iteratively maximizes the conditional log-likelihood of a single unobservable complete data space, rather than maximizing the intractable likelihood function for the measured or incomplete data. EM algorithms update all paramete...
متن کاملStatistica Sinica 5(1995), 19-39 ML ESTIMATION OF THE t DISTRIBUTION USING EM AND ITS EXTENSIONS, ECM AND ECME
The multivariate t distribution has many potential applications in applied statistics. Current computational advances will make it routinely available in practice in the near future. Here we focus on maximum likelihood estimation of the parameters of the multivariate t, with known and unknown degrees of freedom, with and without missing data, and with and without covariates. We describe EM, ECM...
متن کامل